Random Walk on a Discrete Torus and Ran- Dom Interlacements
نویسنده
چکیده
We investigate the relation between the local picture left by the trajectory of a simple random walk on the torus (Z/NZ), d ≥ 3, until uN time steps, u > 0, and the model of random interlacements recently introduced by Sznitman [9]. In particular, we show that for large N , the joint distribution of the local pictures in the neighborhoods of finitely many distant points left by the walk up to time uN converges to independent copies of the random interlacement at level u.
منابع مشابه
On the fragmentation of a torus by random walk
Abstract. We consider a simple random walk on a discrete torus (Z/NZ) with dimension d ≥ 3 and large side length N . For a fixed constant u ≥ 0, we study the percolative properties of the vacant set, consisting of the set of vertices not visited by the random walk in its first [uN] steps. We prove the existence of two distinct phases of the vacant set in the following sense: if u > 0 is chosen ...
متن کاملOn Pinned Fields, Interlacements, and Random Walk on (z/nz)
We define two families of Poissonian soups of bidirectional trajectories on Z2, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus (Z/NZ)2, started from the uniform distribution, run up to a time of order (N logN)2 and forced to avoid a fixed point. The local limit of the latter was recently established in [6]. Our construc...
متن کاملLarge deviations for simple random walk on percolations with long-range correlations
We show quenched large deviations for the simple random walk on percolation models with long-range correlations defined by Drewitz, Ráth and Sapozhnikov [3], which contain supercritical Bernoulli percolations, random interlacements, the vacant set of random interlacements and the level set of the Gaussian free field. Our result is an extension of Kubota’s result [8] for supercritical Bernoulli ...
متن کاملThe loop - erased random walk and the uniform spanning tree on the four - dimensional discrete torus
Let x and y be points chosen uniformly at random from Z4n, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n(logn), resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on Z4n is the Brownian continuum random tree of Aldous. Our proofs use the techniq...
متن کاملRandom walks on discrete cylinders with large bases and random interlacements
Following the recent work of Sznitman [20], we investigate the microscopic picture induced by a random walk trajectory on a cylinder of the form GN ×Z, where GN is a large finite connected weighted graph, and relate it to the model of random interlacements on infinite transient weighted graphs. Under suitable assumptions, the set of points not visited by the random walk until a time of order |G...
متن کامل